Absolute-Type Shaft Encoding Using LFSR Sequences with Prescribed Length

نویسندگان

  • J. M. Fuertes
  • E. Ventura
چکیده

Maximal-length binary sequences have been known for a long time. They have many interesting properties, one of them is that when taken in blocks of n consecutive positions they form 2 − 1 different codes in a closed circular sequence. This property can be used for measuring absolute angular positions as the circle can be divided in as many parts as different codes can be retrieved. This paper describes how a closed binary sequence with arbitrary length can be effectively designed with the minimal possible block-length, using linear feedback shift registers (LFSR). Such sequences can be used for measuring a specified exact number of angular positions, using the minimal possible number of sensors that linear methods allow.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Absolute Position Measurement Using Pseudo-Random Binary Encoding

This paper presents a new absolute position measurement method using pseudo-random binary sequences. This encoding technique has the notable advantage of requiring only one code-symbol per quantization interval. This compact encoding method offers an economical solution to very-highresolution absolute position applications: shaft encoders, linear encoders, and "automated guided vehicle" (AGV) n...

متن کامل

Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm

An analysis of the Berlekamp-Massey Linear Feedback Shift-Register (LFSR) Synthesis Algorithm is provided which shows that an input string of length 12 requires C ( i 2 ) multiplication/ addition operations in the underlying field of definition. We also derive the length distribution for digit strings of length n. Results show that, on the average, the encoded length is no greater than n + l . ...

متن کامل

A Modified Jacobi Sequence Construction Using Multi-Rate Legendre Sequences

This paper investigates the generation of a binary Modified Jacobi sequence by means of an additive combination of constituent binary Legendre sequences which are clocked at different rates. These multi-rate combinations demonstrate that sequences of large linear complexity can be generated without resorting to linear feedback shift registers (LFSRs) of large length. Results on the linear compl...

متن کامل

An Efficient Deterministic Test Pattern Compaction Scheme Using Modified IC Scan Chain

In this paper, we propose a new scheme for Built-In Self-Test (BIST) that uses an LFSR obtained by adding feedback loops to the IC boundary scan chain. This LFSR first generates random patterns to cover easy-to-test faults and after the random testing phase it is partially loaded with seeds to generate deterministic vectors for hard-to-test faults. The seeds are obtained by solving systems of l...

متن کامل

Development of State Model Theory for External Exclusive NOR Type LFSR Structures

Using state space technique and GF(2) theory, a simulation model for external exclusive NOR type LFSR structures is developed. Through this tool a systematic procedure is devised for computing pseudo-random binary sequences from such structures. Keywords—LFSR, external exclusive NOR type, recursive binary sequence, initial state next state, state transition matrix.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006